Query Processing using Negative Tuples in Stream Query Engines
نویسندگان
چکیده
The concept of Negative Tuples (or delete tuples) has been adopted widely in data stream management systems to evaluate continuous sliding-window queries incrementally . The main idea is to produce a negative tuple for each expired tuple from the sliding window. Thus, various query operators can update their state based on the expired tuples. Negative tuples avoid the non-deterministic output delays that result from the commonly used input-triggered approach. However, negative tuples double the number of tuples through the query pipeline, thus reducing the pipeline bandwidth. In this paper, we put the negative tuples under a magnifying glass where we show its detailed realization in terms of its generation and its processing in various operators. Then, we present several optimization techniques that aim to reduce the overhead of the negative tuples approach. These optimizations can be applied independently or together to enhance the performance of negative tuples. A detailed experimental study, based on a prototype system implementation, shows the performance gains over the input-triggered approach of the negative tuples approach when accompanied with the proposed optimizations.
منابع مشابه
Query Processing Using Negative and Temporal Tuples in Stream Query Engines
In this paper, we analyze how stream monotonicity classification can be adopted for the introduced developed model, which processes both temporal and negative events. As we show, information about stream monotonicity can be easily used to optimize individual stream operators as well as a full query plan. Comparing our stream engine with such engines as CEDR, STREAM and PIPES we demonstrate how ...
متن کاملDiscovering Popular Clicks\' Pattern of Teen Users for Query Recommendation
Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...
متن کاملA Framework For Supporting Load Shedding in Data Stream Management Systems
The arrival rate of tuples in a data stream can be unpredictable and bursty. Many stream-based applications have Quality of Service (QoS) requirements that need to be satisfied by the underlying stream processing system. In order to avoid violating predefined QoS requirements during temporary overload periods, a load shedding strategy is necessary and critical for a data stream management syste...
متن کاملQuery expansion based on relevance feedback and latent semantic analysis
Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expa...
متن کاملمدل جدیدی برای جستجوی عبارت بر اساس کمینه جابهجایی وزندار
Finding high-quality web pages is one of the most important tasks of search engines. The relevance between the documents found and the query searched depends on the user observation and increases the complexity of ranking algorithms. The other issue is that users often explore just the first 10 to 20 results while millions of pages related to a query may exist. So search engines have to use sui...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013